Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar4/RubioSLASHbintrees.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.

↳ QTRS

  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

The set Q consists of the following terms:

concat₂(leaf, x0)
concat₂(cons₂(x0, x1), x2)
lessleaves₂(x0, leaf)
lessleaves₂(leaf, cons₂(x0, x1))
lessleaves₂(cons₂(x0, x1), cons₂(x2, x3))

Q DP problem:
The TRS P consists of the following rules:

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(W, Z)
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(U, V)
CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

The set Q consists of the following terms:

concat₂(leaf, x0)
concat₂(cons₂(x0, x1), x2)
lessleaves₂(x0, leaf)
lessleaves₂(leaf, cons₂(x0, x1))
lessleaves₂(cons₂(x0, x1), cons₂(x2, x3))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(W, Z)
LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> CONCAT₂(U, V)
CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

The set Q consists of the following terms:

concat₂(leaf, x0)
concat₂(cons₂(x0, x1), x2)
lessleaves₂(x0, leaf)
lessleaves₂(leaf, cons₂(x0, x1))
lessleaves₂(cons₂(x0, x1), cons₂(x2, x3))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 2 SCCs with 2 less nodes.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPAfsSolverProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

The set Q consists of the following terms:

concat₂(leaf, x0)
concat₂(cons₂(x0, x1), x2)
lessleaves₂(x0, leaf)
lessleaves₂(leaf, cons₂(x0, x1))
lessleaves₂(cons₂(x0, x1), cons₂(x2, x3))

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

CONCAT₂(cons₂(U, V), Y) -> CONCAT₂(V, Y)

Used argument filtering: CONCAT₂(x1, x2) = x1
cons₂(x1, x2) = cons₁(x2)
Used ordering: Quasi Precedence: trivial

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPAfsSolverProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

The set Q consists of the following terms:

concat₂(leaf, x0)
concat₂(cons₂(x0, x1), x2)
lessleaves₂(x0, leaf)
lessleaves₂(leaf, cons₂(x0, x1))
lessleaves₂(cons₂(x0, x1), cons₂(x2, x3))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Non-Overlap Check

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LESSLEAVES₂(cons₂(U, V), cons₂(W, Z)) -> LESSLEAVES₂(concat₂(U, V), concat₂(W, Z))

The TRS R consists of the following rules:

concat₂(leaf, Y) -> Y
concat₂(cons₂(U, V), Y) -> cons₂(U, concat₂(V, Y))
lessleaves₂(X, leaf) -> false
lessleaves₂(leaf, cons₂(W, Z)) -> true
lessleaves₂(cons₂(U, V), cons₂(W, Z)) -> lessleaves₂(concat₂(U, V), concat₂(W, Z))

The set Q consists of the following terms:

concat₂(leaf, x0)
concat₂(cons₂(x0, x1), x2)
lessleaves₂(x0, leaf)
lessleaves₂(leaf, cons₂(x0, x1))
lessleaves₂(cons₂(x0, x1), cons₂(x2, x3))

We have to consider all minimal (P,Q,R)-chains.